Computationally Efficient Algorithm for computing Cumulative Grade Point Average of a Large Number of Students

نویسنده

  • R. O. Akinola
چکیده

One major problem faced by Level Coordinators at the University of Jos is the computation of their students' Cumulative Grade Point Average (CGPA) in senate format at the end of each session. To many a lecturer, it is laborious, time wasting and a frustrating exercise. This paper proposes a python based algorithm for computing each students CGPA for an entire level in a fast and less tasking manner. It surpasses an earlier algorithm proposed by the same author which uses octave and has the capability to compute the TCE, TGP, TGR, GPA, their cumulatives as well as state which courses are to be repeated or if a student passed (i.e., no carry over) by default. The algorithm can also state each student’s class of degree which makes it more powerful.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

متن کامل

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

Knowledge of Last Year Students of Dentistry at Islamic Azad University, Tehran Medical Sciences, Towards Principles of Ethics in 2020

Background and  Aims : Student course is the best time to learn the principles and methods of applying professional ethics, which results in establishing proper communication with patients. However, few studies have been conducted on the level of knowledge of dental students about ethical principles. This study was conducted to investigate the knowledge of last year dental students of the Islam...

متن کامل

Implementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey

Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014